Fairness in Peer-to-Peer Networks
نویسندگان
چکیده
Consider a P2P network consisting of a set of peers P and a set of services S, whereby each peer p is interested in one or several services and/or offers different services. Thereby, providing a service consumes a scarce resource. We denote the capacity of this resource at peer p as Cp. To differentiate between service providing and service requesting peers in our model we introduce the set of service providers SP and the set of service customers SC. A peer is a member of SP or SC if it offers or requests at least one service, respectively. One peer can be a member of both sets, which is the predominant case in P2P networks. Since each peer has only a partial view of the whole P2P network, a service requesting peer is not aware of all peers that provide this service, and vice versa. We define the set of peers, which offer at least one service to peer c, the service customer, as the set of service providers SP(c) of peer c. The other way around SC(p) is the set of the known service customers of the service providing peer p. Suppose the utility of a service customer c is defined by a concave, strictly increasing utility function U , which depends on the total service rate yc. Similar to the rate control algorithm for IP networks we model the resource allocation
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملEmerging Properties of Knowledge Sharing Referral Networks: Considerations of Effectiveness and Fairness
Referral-based peer-to-peer networks have a wide range of applications. They provide a natural framework in which agents can help each other. This paper studies the trade-off between social welfare and fairness in referral networks. The traditional, naive mechanism yields high social welfare but at the cost of some agents—in particular, the “best” ones—being exploited. Autonomous agents would o...
متن کاملA Fairness Model for Resource Allocation in Wireless Networks
In wireless networks many nodes contend for available resources creating a challenge in resource allocation. With shared resources, fairness in allocation is a serious issue. Fairness metrics have been defined to measure the fairness level of resource decisions in allocations. Therefore, fairness metrics significantly influence network and node performances emphasizing the need for due diligenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006